Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → B(c(a(a(x1))))
A(c(x1)) → A(x1)
A(c(x1)) → A(a(x1))

The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → B(c(a(a(x1))))
A(c(x1)) → A(x1)
A(c(x1)) → A(a(x1))

The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → A(x1)
A(c(x1)) → A(a(x1))

The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


A(c(x1)) → A(x1)
The remaining pairs can at least be oriented weakly.

A(c(x1)) → A(a(x1))
Used ordering: Polynomial Order [21,25] with Interpretation:

POL( A(x1) ) = x1


POL( c(x1) ) = x1 + 1


POL( b(x1) ) = max{0, x1 - 1}


POL( a(x1) ) = x1 + 1



The following usable rules [17] were oriented:

a(a(b(x1))) → c(x1)
b(c(x1)) → x1
a(c(x1)) → b(c(a(a(x1))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → A(a(x1))

The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(c(x1)) → A(a(x1)) at position [0] we obtained the following new rules:

A(c(a(b(x0)))) → A(c(x0))
A(c(c(x0))) → A(b(c(a(a(x0)))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ QDPToSRSProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(a(b(x0)))) → A(c(x0))
A(c(c(x0))) → A(b(c(a(a(x0)))))

The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ QDPToSRSProof
                    ↳ QTRS
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1
A(c(a(b(x0)))) → A(c(x0))
A(c(c(x0))) → A(b(c(a(a(x0)))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1
A(c(a(b(x0)))) → A(c(x0))
A(c(c(x0))) → A(b(c(a(a(x0)))))

The set Q is empty.
We have obtained the following QTRS:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x
b(a(c(A(x)))) → c(A(x))
c(c(A(x))) → a(a(c(b(A(x)))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ QDPToSRSProof
                    ↳ QTRS
                      ↳ QTRS Reverse
                        ↳ QTRS
                          ↳ DependencyPairsProof
                          ↳ QTRS Reverse
                          ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x
b(a(c(A(x)))) → c(A(x))
c(c(A(x))) → a(a(c(b(A(x)))))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → B(x)
B(a(a(x))) → C(x)
C(a(x)) → C(b(x))
C(c(A(x))) → B(A(x))
C(c(A(x))) → C(b(A(x)))

The TRS R consists of the following rules:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x
b(a(c(A(x)))) → c(A(x))
c(c(A(x))) → a(a(c(b(A(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ QDPToSRSProof
                    ↳ QTRS
                      ↳ QTRS Reverse
                        ↳ QTRS
                          ↳ DependencyPairsProof
                            ↳ QDP
                              ↳ DependencyGraphProof
                          ↳ QTRS Reverse
                          ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → B(x)
B(a(a(x))) → C(x)
C(a(x)) → C(b(x))
C(c(A(x))) → B(A(x))
C(c(A(x))) → C(b(A(x)))

The TRS R consists of the following rules:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x
b(a(c(A(x)))) → c(A(x))
c(c(A(x))) → a(a(c(b(A(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ QDPToSRSProof
                    ↳ QTRS
                      ↳ QTRS Reverse
                        ↳ QTRS
                          ↳ DependencyPairsProof
                            ↳ QDP
                              ↳ DependencyGraphProof
                                ↳ QDP
                          ↳ QTRS Reverse
                          ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → B(x)
B(a(a(x))) → C(x)
C(a(x)) → C(b(x))

The TRS R consists of the following rules:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x
b(a(c(A(x)))) → c(A(x))
c(c(A(x))) → a(a(c(b(A(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x
b(a(c(A(x)))) → c(A(x))
c(c(A(x))) → a(a(c(b(A(x)))))

The set Q is empty.
We have obtained the following QTRS:

a(a(b(x))) → c(x)
a(c(x)) → b(c(a(a(x))))
b(c(x)) → x
A(c(a(b(x)))) → A(c(x))
A(c(c(x))) → A(b(c(a(a(x)))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ QDPToSRSProof
                    ↳ QTRS
                      ↳ QTRS Reverse
                        ↳ QTRS
                          ↳ DependencyPairsProof
                          ↳ QTRS Reverse
                            ↳ QTRS
                          ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(b(x))) → c(x)
a(c(x)) → b(c(a(a(x))))
b(c(x)) → x
A(c(a(b(x)))) → A(c(x))
A(c(c(x))) → A(b(c(a(a(x)))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x
b(a(c(A(x)))) → c(A(x))
c(c(A(x))) → a(a(c(b(A(x)))))

The set Q is empty.
We have obtained the following QTRS:

a(a(b(x))) → c(x)
a(c(x)) → b(c(a(a(x))))
b(c(x)) → x
A(c(a(b(x)))) → A(c(x))
A(c(c(x))) → A(b(c(a(a(x)))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ QDPToSRSProof
                    ↳ QTRS
                      ↳ QTRS Reverse
                        ↳ QTRS
                          ↳ DependencyPairsProof
                          ↳ QTRS Reverse
                          ↳ QTRS Reverse
                            ↳ QTRS
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(b(x))) → c(x)
a(c(x)) → b(c(a(a(x))))
b(c(x)) → x
A(c(a(b(x)))) → A(c(x))
A(c(c(x))) → A(b(c(a(a(x)))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

The set Q is empty.
We have obtained the following QTRS:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
    ↳ QTRS
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(a(b(x1))) → c(x1)
a(c(x1)) → b(c(a(a(x1))))
b(c(x1)) → x1

The set Q is empty.
We have obtained the following QTRS:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse
    ↳ QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(x))) → c(x)
c(a(x)) → a(a(c(b(x))))
c(b(x)) → x

Q is empty.